package leetcode;

public class _0082 {
    /**
     *  删除排序链表中的重复元素 II
     */
    /**
     * Definition for singly-linked list.
     * public class ListNode {
     *     int val;
     *     ListNode next;
     *     ListNode() {}
     *     ListNode(int val) { this.val = val; }
     *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
     * }
     */
    private class ListNode {
        ListNode next;
        int val;
        ListNode(){}
        ListNode(int val){
            this.val=val;
        }
        ListNode(int val, ListNode next){
            this.val = val;
            this.next = next;
        }
    }
    class Solution {
        public ListNode deleteDuplicates(ListNode head) {
            ListNode dummy = new ListNode(0,head);
            ListNode cur = dummy;
            while(cur.next!=null&&cur.next.next!=null){
                int val = cur.next.val;
                if(cur.next.next.val==val){
                    while(cur.next!=null&&cur.next.val==val){
                        cur.next = cur.next.next;
                    }
                }else{
                    cur =cur.next;
                }
            }
            return dummy.next;
        }
    }
}
